Morphisms of Coloured Petri Nets
نویسنده
چکیده
Abstract. We introduce the concept of a morphism between coloured nets. Our definition generalizes Petris definition for ordinary nets. A morphism of coloured nets maps the topological space of the underlying undirected net as well as the kernel and cokernel of the incidence map. The kernel are flows along the transitionbordered fibres of the morphism, the cokernel are classes of markings of the place-bordered fibres. The attachment of bindings, colours, flows and marking classes to a subnet is formalized by using concepts from sheaf theory. A coloured net is a sheaf-cosheaf pair over a Petri space and a morphism between coloured nets is a morphism between such pairs. Coloured nets and their morphisms form a category. We prove the existence of a product in the subcategory of sort-respecting morphisms. After introducing markings our concepts generalize to coloured Petri nets.
منابع مشابه
Availability evaluation of Software architecture of object oriented Style using coloured Petri nets
Software architecture is one of the most fundamental products in the process of software development in the areas of behavioral or non- behavioral features like availability or transformability change. There are different ways to evaluate software architecture one of which is the creation of application model. An executable model of software architecture is an official description of architectu...
متن کاملFinite Completeness of Categories of Petri Nets
The problem of finite completeness of categories of Petri nets is studied. Since Petri nets have finite products, the problem reduces to the issue of the existence of equalizers. We show that the categories of Petri nets with general and Winskel morphisms do not admit equalizers, and hence are not finitely complete. An important class of multiplicative Petri net morphisms is also identified. Th...
متن کاملA New Definition of Morphism on Petri Nets
Petri nets are a fundamental model of concurrent processes and have a wide range of applications. They can be viewed as generalisation of transition systems in which concurrency is not simulated by non-deterministic interleaving. They were invented by C. A. Petri in the 60's. (A reference work is [Br].) It can be argued that the main effort and success of Petri Net Theory has been in developing...
متن کاملMorphisms on Marked Graphs
Abstract. Many kinds of morphisms on Petri nets have been defined and studied. They can be used as formal techniques supporting refinement/abstraction of models. In this paper we introduce a new notion of morphism on marked graphs, a class of Petri nets used for the representation of systems having deterministic behavior. Such morphisms can indeed be used to represent a form of abstraction on m...
متن کاملA Uniform Approach to Petri Nets
The new concept of parameterized net classes is introduced in order to allow a uniform presentation of diierent kinds of Petri net classes. By diierent actualizations of the net structure parameter and the data type parameter we obtain several well-known net classes, like elementary nets, place-transition nets, coloured Petri nets, pred-icate/transition nets, and algebraic high-level nets, as w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/cs/0608038 شماره
صفحات -
تاریخ انتشار 2006